Abstract Interpretation based Verification of Logic Programs
نویسندگان
چکیده
Interpretation based Verification of Logic Programs Marco Comini, Roberta Gori, Giorgio Levi, Paolo Volpe Dipartimento di Informatica Università di Pisa Pisa, Italy
منابع مشابه
VeriPolyTypes: a tool for Verification of Logic Programs w.r.t. Type Specifications
In this system demonstration we present a tool for the verification of Logic Programs w.r.t. type information specifications. The tool is based on sufficient verification conditions obtained by abstract interpretation. Following the theoretical foundation in [2,4,3], the tool is obtained by transforming a static analyzer on a type domain for Logic Programs designed by Codish and Lagoon [1].
متن کاملAssertion based Inductive Verification Methods for Logic Programs
This paper is an overview of our results on the application of abstract interpretation concepts to the derivation of a verification method for logic programs. These include the systematic design of semantics modeling various proof methods and the characterization of assertions as abstract domains. We first apply the verification framework defined in [5] to derive inductive sufficient conditions...
متن کاملInterpolation-Based Verification of Floating-Point Programs with Abstract CDCL
One approach for smt solvers to improve efficiency is to delegate reasoning to abstract domains. Solvers using abstract domains do not support interpolation and cannot be used for interpolation-based verification. We extend Abstract Conflict Driven Clause Learning (acdcl) solvers with proof generation and interpolation. Our results lead to the first interpolation procedure for floating-point lo...
متن کاملExecution and Verification of Imperative Programs
This paper studies the relation between execution and verification. A simple imperative language with execution and verification commands is introduced. A machine only executes execution commands of a program, while the compiler only performs the verification commands. Common commands in other languages can be defined as a combination of execution and verification commands. Design of verifiers ...
متن کاملVerifying Partial Correctness of Logic Programs with Delay Declarations
In this paper we propose a method for verifying partial correctness of logic programs with delay declarations. The method is based on the notion of specialised derivation. It diiers from the deenition of SLD-derivation since more instantiated general uniiers are computed instead of standard mgus. The contribution of this paper follows from the observation that the derivations of logic programs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 40 شماره
صفحات -
تاریخ انتشار 1999